A New Public Key Cryptosystem based on Matrices

نویسندگان

  • RAFAEL ALVAREZ
  • FRANCISCO-MIGUEL MARTINEZ
  • ANTONIO ZAMORA
چکیده

This paper describes a new method for authentication and integrity where the ciphertext is obtained using block upper triangular matrices with elements in p Z , in which the discrete logarithm problem (DLP) defined over a finite group is used. In the proposed public key cryptosystem, the encryption requires very few operations and decryption is equivalent to the DLP and, finally, the signature scheme presented is based on the ElGamal signature scheme and requires the original message in order to verify the signature. With this system we get a large key space without increasing the difficulty of the problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations

GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...

متن کامل

QTRU: quaternionic version of the NTRU public-key cryptosystems

In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...

متن کامل

Homomorphic public-key cryptosystems over groups and rings

We propose a new homomorphic public-key cryptosystem over arbitrary nonidentity nite group based on the di culty of the membership problem for groups of integer matrices. Besides, a homomorphic cryptosystem is designed for the rst time over nite commutative rings.

متن کامل

Improving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes

This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...

متن کامل

A new cryptosystem based on elliptic curves and polynomial matrices*

The system we propose is a mathematical problem with the necessary properties to define public key cryptosystems. It is based on the Elliptic Curve Discrete Logarithm Problem (ECDLP) and polynomial matrices. In this way, we achieve to increase the possible number of keys and, therefore, we augment the resolution complexity of the system. Also, we make a cryptanalisys of the system detecting its...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007